A Maximum Principle for Single-Input Boolean Control Networks
نویسندگان
چکیده
منابع مشابه
A Pontryagin Maximum Principle for Multi–Input Boolean Control Networks⋆
A Boolean network consists of a set of Boolean variables whose state is determined by other variables in the network. Boolean networks have been studied extensively as models for simple artificial neural networks. Recently, Boolean networks gained considerable interest as models for biological systems composed of elements that can be in one of two possible states. Examples include genetic regul...
متن کاملPrinciple for performing attractor transits with single control in Boolean networks.
We present an algebraic approach to reveal attractor transitions in Boolean networks under single control based on the recently developed matrix semitensor product theory. In this setting, the reachability of attractors is estimated by the state transition matrices. We then propose procedures that compute the shortest control sequence and the result of each step of input (control) exactly. The ...
متن کاملMaximum Principle for Singular Stochastic Control Problems
In this paper, an optimal singular stochastic control problem is considered. For this model, it is obtained a general stochastic maximum principle by using a time transformation. This is the first version of the stochastic maximum principle that covers the singular control problem in the nonlinear case.
متن کاملPontryagin Maximum Principle for Optimal Control of
In this paper we investigate optimal control problems governed by variational inequalities. We present a method for deriving optimality conditions in the form of Pontryagin's principle. The main tools used are the Ekeland's variational principle combined with penalization and spike variation techniques. 1. Introduction. The purpose of this paper is to present a method for deriving a Pontryagin ...
متن کاملIdentification problems for Boolean networks and Boolean control networks
In this paper we address various forms of identification problems for Boolean networks (BNs) and for Boolean control networks (BCNs). For the former, we assume to have a set of infinite or finite support output trajectories and we want to identify a BN compatible with those trajectories. Conditions for the identified BN to coincide (up to a relabeling) with the original BN are provided. For BCN...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2011
ISSN: 0018-9286
DOI: 10.1109/tac.2010.2101430